A 2-Approximation Algorithm for Sorting by Prefix Reversals
نویسندگان
چکیده
Sorting by Prefix Reversals, also known as Pancake Flipping, is the problem of transforming a given permutation into the identity permutation, where the only allowed operations are reversals of a prefix of the permutation. The problem complexity is still unknown, and no algorithm with an approximation ratio better than 3 is known. We present the first polynomial-time 2-approximation algorithm to solve this problem. Empirical tests suggest that the average performance is in fact better than 2.
منابع مشابه
Pancake Flipping with Two Spatulas
In this paper we study several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding with prefix reversals other similar operations such as prefix transpositions and prefix transreversals. These type of sorting problems have applications in interconnection networks and compu...
متن کاملSorting by Prefix Reversals and Prefix Transpositions with Forward March
Sorting permutations by reversals and/or transpositions is an important genome rearrangement problem in computational molecular biology. From theoretical point of view, finding efficient algorithms for this problem and its variations are quite challenging. In this paper we consider the problem of sorting unsigned permutations by prefix reversals and prefix transpositions, where a prefix reversa...
متن کامل. C O ] 4 J ul 2 00 6 Prefix reversals on binary and ternary strings ⋆
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Bounds for sorting by prefix reversal, Discrete Mathematics 27, pp. 47-57), asks for the minimum number of prefix reversals required to sort the elements of a giv...
متن کاملar X iv : m at h / 06 02 45 6 v 1 [ m at h . C O ] 2 1 Fe b 20 06 Prefix reversals on binary and ternary strings ⋆
The problem Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou [7], asks for the minimum number of prefix reversals required to sort the elements of a given permutation. In this paper we study a variant of this problem where the prefix reversals act not on permutations but on strings over a fixed-size alphabet. We demonstrate polynomial-time alg...
متن کاملPrefix Reversals on Binary and Ternary Strings
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Discrete Math., 27 (1979), pp. 47–57), asks for the minimum number of prefix reversals required to sort the elements of a given permutation. In this paper we stud...
متن کامل